On the construction of permutation complexes for profinite groups

نویسندگان

  • PETER SYMONDS
  • Peter Symonds
چکیده

In [5], Goerss, Henn, Mahowald and Rezk consider the special extended Morava stabilizer group G2 = S2 o Gal at the prime 3 and construct an exact sequence of compact modules 0→ Ind 1 2 G24 Ẑ3 → Ind G2 SD16 Ẑ3(χ)→ Ind G2 SD16 Ẑ3(χ)→ Ind G2 G24 Ẑ3 → Ẑ3 → 0, where G24 is a subgroup of order 24 etc, and Ẑ3(χ) is a copy of Ẑ3 on which SD16 acts via a character χ : SD16 → {±1}. They then use this to construct a certain tower of spectra.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Continuous Cohomology of Permutation Groups on Profinite Modules

We investigate the continuous cohomology of infinite permutation groups on modules whose topology is profinite. To obtain acyclics we expand the class of modules to include those which are directed unions of their profinite submodules. As an application we give a criterion which implies finiteness of the continuous cohomology groups on finitely generated profinite modules for some familiar perm...

متن کامل

Cohomology of Profinite Groups

The aim of this thesis is to study profinite groups of type FPn. These are groups G which admit a projective resolution P of Ẑ as a ẐJGK-module such that P0, . . . , Pn are finitely generated, so this property can be studied using the tools of profinite group cohomology. In studying profinite groups it is often useful to consider their cohomology groups with profinite coefficients, but pre-exis...

متن کامل

Type-Itemized Enumeration of RS-Stereoisomers of Octahedral Complexes

Stereoisograms of octahedral complexes are classified into five types (type I--typeV) under the action of the corresponding RS-stereoisomeric group. Their enumeration is accomplished in a type-itemized fashion, where Fujita's proligand method developed originally for combinatorial enumeration under point groups (S. Fujita, Theor. Chem. Acc., 113, 73--79 (2005)) is extended to meet the requireme...

متن کامل

Maximal Subgroups in Finite and Profinite Groups

We prove that if a finitely generated profinite group G is not generated with positive probability by finitely many random elements, then every finite group F is obtained as a quotient of an open subgroup of G. The proof involves the study of maximal subgroups of profinite groups, as well as techniques from finite permutation groups and finite Chevalley groups. Confirming a conjecture from Ann....

متن کامل

Group laws and free subgroups in topological groups

We prove that a permutation group in which different finite sets have different stabilizers cannot satisfy any group law. For locally compact topological groups with this property we show that almost all finite subsets of the group generate free subgroups. We derive consequences of these theorems on Thompson’s group F , weakly branch groups, automorphism groups of regular trees and profinite gr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009